Initial Results on the F-logic to OWL Bi-directional Translation on a Tabled Prolog Engine
نویسنده
چکیده
In this paper, we show our results on the bi-directional data exchange between the F-logic language supported by the Flora2 system and the OWL language. Most of the TBox and ABox axioms are translated preserving the semantics between the two representations, such as: proper inclusion, individual definition, functional properties, while some axioms and restrictions require a change in the semantics, such as: numbered and qualified cardinality restrictions. For the second case, we translate the OWL definite style inference rules into F-logic style constraints. We also describe a set of reasoning examples using the above translation, including the reasoning in Flora2 of a variety of ABox queries.
منابع مشابه
Tabled Abduction in Logic Programs
Abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled for reuse. On the other hand, current Prolog systems, with their tabling mechanisms, are mature enough to facilitate the specific introduction of tabling abductive solutions (tabled abduction) into them. We concept...
متن کاملSweetProlog: A System to Integrate Ontologies and Rules
This paper describes the design and implementation of SweetProlog, a system for translating Web rules into Prolog. It enables the integration of ontologies and rules on the Semantic Web. This is achieved via a translation of OWL ontologies described in Description Logics and rules expressed in OWLRuleML into a set of facts and rules described in Prolog. Finally, the resulting logic program is i...
متن کاملIntegrating Metadata and Data Syntax Translation
In syntax translation between languages, the advantage of using a single internal language as a translation mediator is a reduction of the total number of translators required. To achieve bi-directional translation between n languages requires n(n − 1) translators without a central mediator, as opposed to 2(n + 1) translators using an internal language. Our goal is to simplify syntax translatio...
متن کاملImplementing Tabled Abduction in Logic Programs
Abduction has been on the back burner in logic programming, as abduction can be too difficult to implement, and costly to perform, in particular if abductive solutions are not tabled. If they become tabled, then abductive solutions can be reused, even from one abductive context to another. On the other hand, current Prolog systems, with their tabling mechanisms, are mature enough to facilitate ...
متن کاملSweetJess: Inferencing in Situated Courteous RuleML via Translation to and from Jess Rules
We describe the innovative design of our prototyped SweetJess tool for RuleML inferencing. Our first contribution is to give a new, implemented translation from a broad but restricted case of SCLP RuleML into Jess rules, and an inverse translation from a broad but further restricted case of Jess rules into SCLP RuleML. SCLP stands for the Situated Courteous Logic Programs knowledge representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0808.1721 شماره
صفحات -
تاریخ انتشار 2008